Scheduling job shop -A case study

Constraint-directed search : a case study of job-shop scheduling

This thesis investigates the problem of constraint-directed reasoning in the job-shop scheduling domain. The job-shop scheduling problem is defined as: selecting a sequence of operations whose execution results in the completion of an order, and assigning times (i.e., start and end times) and resources to each operation. The number of possible schedules grows exponentially with the number of or...

Constraint-Directed Search: A Case Study of Job-Shop Scheduling

Job-shop scheduling in a body shop

We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...

Job-shop scheduling

The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...

Hybrid job shop scheduling

We consider the problem of scheduling jobs in a hybrid job shop We use the term hybrid to indicate that we consider a lot of extensions of the classic job shop such as transportation times multiple resources and setup times The Shifting Bottleneck procedure can be generalized to deal with those extensions We test this approach for an assembly shop In this shop we study the in uence of static an...